function [tr_list] = find_tr_with_verts(topology, v)
vert_num = size(v, 2);
face_num = size(topology, 1);
tr_counter = 0;
for i = 1 : face_num
    contains = 0;
    for j = 1 : vert_num
        contains = tr_contains_vert(topology, i, v(j));
        if (contains == 0) 
            break
        end % IF
    end % FOR
    if (contains)
        tr_counter = tr_counter + 1;
        tr_list(tr_counter) = i;
    end % IF
end % FOR
end % FUNCTION find_tr_with_verts